The symbol-pair distance distribution of repeated-root cyclic codes over $\mathbb{F}_{p^m}$
نویسندگان
چکیده
Abstract: Symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One of the most important task in symbol-pair coding theory is to determine the minimum pair-distance of symbol-pair codes. In this paper, we investigate the symbol-pair distances of cyclic codes of length p over Fpm . The exact symbol-pair distances of all cyclic codes of such length are determined.
منابع مشابه
B-symbol Distance Distribution of Repeated-root Cyclic Codes
Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitations of the reading process in high-density data storage technologies. Yaakobi et al. [8] introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we come up with a me...
متن کاملRepeated Root Constacyclic Codes of Length $mp^s$ over $\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$
We give the structure of λ-constacyclic codes of length pm over R = Fpr +uFpr + . . .+uFpr with λ ∈ F ∗ pr . We also give the structure of λ-constacyclic codes of length pm with λ = α1 + uα2 + . . .+ u αe−1, where α1, α2 6= 0 and study the self-duality of these codes.
متن کاملA Note on Hamming distance of constacyclic codes of length $p^s$ over $\mathbb F_{p^m} + u\mathbb F_{p^m}$
For any prime p, λ-constacyclic codes of length p over R = Fpm + uFpm are precisely the ideals of the local ring Rλ = R[x] 〈xp−λ〉 , where u = 0. In this paper, we first investigate the Hamming distances of cyclic codes of length p over R. The minimum Hamming distances of all cyclic codes of length p over R are determined. Moreover, an isometry between cyclic and α-constacyclic codes of length p...
متن کاملGeneralized Quasi-Cyclic Codes Over $\mathbb{F}_q+u\mathbb{F}_q$
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring Fq + uFq, where u 2 = 0, q = p, n a positive integer and p a prime number, are investigated. By the Chinese Remainder Theorem, structural properties and the decomposition of GQC codes are given. For 1-generator GQC codes, minimal generating sets and lower bounds on the minimum distance are given. As a special class of GQC...
متن کاملOn Quantum Codes Obtained From Cyclic Codes Over $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
The aim of this paper is to develop the theory for constructing DNA cyclic codes of odd length over R = Z4[u]/〈u 2 − 1〉. Firstly, we relate DNA pairs with a special 16 element of ring R. Cyclic codes of odd length over R satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the GC-content of these codes and their deletion distance. The p...
متن کامل